Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
361	PIIM D ATA V I S U A L I Z AT I O N D E S I G N G U I D E L I N E S 68 5th Avenue Room 200 New York, NY 10011 Add to Reading List Source URL: piim.newschool.edu Language: English - Date: 2014-03-18 15:38:01 Graph Tree NP-complete problems Matroid theory Exponential random graph models Trapezoid graph Graph theory Mathematics Line graph
362	A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Samuel Rota Bul`o, and Marcello Pelillo Dipartimento di Informatica. Universit` a Ca’ Foscari di Venezia. Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2009-08-09 08:17:46 Graph operations Clique Extremal graph theory Vertex cover Hypergraph Line graph Graph theory Theoretical computer science NP-complete problems
363	Graph-theoretic methods in combinatorial (algebraic) topology Michal Adamaszek Universit¨ at Bremen Add to Reading List Source URL: projects.au.dk Language: English - Date: 2013-04-29 03:32:40 Triangulation Clique NP-complete problems Graph coloring Simplicial complex Chordal graph Clique problem Hadwiger conjecture Graph theory Mathematics Algebraic topology
364	PDF Document Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:11:28 NP-complete problems Vertex cover Approximation algorithm Cubic graph Feedback arc set Dominating set Graph theory Theoretical computer science Mathematics
365	Dalke and Hastings Journal of Cheminformatics 2013, 5(Suppl 1):O6 http://www.jcheminf.com/content/5/S1/O6 ORAL PRESENTATION Open Access Add to Reading List Source URL: www.jcheminf.com Language: English NP-complete problems Cheminformatics Computational chemistry Graph theory Maximum common subgraph isomorphism problem Subgraph isomorphism problem Chemistry Matching Graph isomorphism Mathematics Theoretical computer science Applied mathematics
366	Ranking Tournaments: Local Search and a New Algorithm TOM COLEMAN and ANTHONY WIRTH The University of Melbourne Ranking is a fundamental activity for organising and, later, understanding data. Advice of the Add to Reading List Source URL: tom.thesnail.org Language: English - Date: 2015-05-04 03:09:24 NP-complete problems Topological sorting Directed graph Algorithm Feedback arc set Network theory Shortest path problem Graph theory Mathematics Theoretical computer science
367	A linear-time algorithm for comparing similar ordered trees H´el`ene Touzet LIFL – University of Lille 1 – France Comparison with k errors Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2005-07-08 16:24:06 Tree Spanning tree NP-complete problems Levenshtein distance Graph theory Theoretical computer science Mathematics
368	CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m. Examples: Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:50 NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory
369	Maximum Motif Problem in Vertex-Colored Graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2009-06-21 01:15:30 Graph coloring NP-complete problems Graph theory Parameterized complexity NP-complete Theoretical computer science Mathematics Applied mathematics
370	Approximation Algorithms for Orienting Mixed Graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2011-09-25 15:14:20 NP-complete problems Graph Directed graph Strongly connected component Strong orientation Graph coloring Path decomposition Graph theory Mathematics Graph connectivity

UPDATE